/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

ll length(ll n)
{
    if (n <= 1)
        return 1;
    return 2 * length(n / 2) + 1;
}
ll findN(ll n)
{
    n |= n >> 1;
    n |= n >> 2;
    n |= n >> 4;
    n |= n >> 8;
    n |= n >> 16; // 整型一般是 32 位，上面我是假设 8 位。
    return (n + 1) >> 1;
}
ll pow_m(ll a, ll b)
{
    ll sum = 1;
    while (b)
    {
        if (b & 1)
        {
            sum = sum * a;
        }
        a = a * a;
        b >>= 1;
    }
    return sum;
}
int main()
{
    IOS;
    ll n = 1125899906842623;
    ll id = 0, ans = 1;
    for (; ans < n;)
    {
        id++;
        ans *= 2;
    }
    if (ans > n)
    {
        id--;
    }
    cout << id << " " << (log(n) / log(2)) << endl;
    // while (n)
    // {
    //     if (findN(n) != (ll)pow(2.0, (ll)log2((double)n)))
    //     {
    //         cout << n << " " << (ll)pow(2.0, (ll)log2((double)n)) << " " << pow_m(2, (ll)log2((double)n)) << endl;
    //         // cout << n << " " << length(n) / 2 + 1 << " " << findN(n) << " " << (ll)pow(2.0, (ll)log2((double)n)) << endl;
    //     }
    //     n /= 2;
    // }
    getchar();
    getchar();
    return 0;
}
